Vertex Characterization of Partition Polytopes of Planar Point Sets

The partition problem concerns the partitioning of n given vectors in d-space into p parts, so as to maximize an objective function which is convex on the sum of vectors in each part. The problem has applications in diverse elds that include clustering, inventory, scheduling and statistical hypothesis testing. Since the objective function is convex, the partition problem can be reduced to the problem of maximizing the same objective over the partition polytope, deened to be the convex hull of all solutions. In this article we completely characterize the vertices of partition polytopes when either d = 2 or p = 2, and determine the maximum number of vertices of any partition polytope of n vectors when d = 2 or p = 2 up to a constant factor. Our characterization implies a bijection between vertices of the polytope and 0-separable partitions, and is best possible in the sense that there are examples in the literature showing the analogue fails already for p = d = 3. Our enumerative results provide lower bounds on the time complexity needed to solve the partition problem when the objective function is presented by an oracle.